On $z$-submonoids and $z$-codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutation decoding of Z 2 Z 4 - linear codes

An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As pa...

متن کامل

Extremal Self - Dual Codes over Z 6 , Z 8 and Z 10

In this paper, upper bounds on the minimum Euclidean weights of Type I codes over Z6 , and self-dual codes over Z8 and Z10 , are derived for modest lengths. The notion of extremality for Euclidean weights is also introduced. We construct new extremal self-dual codes over these rings. Most of these codes are obtained via the double circulant and quasitwisted constructions. New extremal odd unimo...

متن کامل

Z 2 Z 4 - Additive Formally Self - Dual Codes

We study odd and even Z2Z4 formally self-dual codes. The images of these codes are binary codes whose weight enumerators are that of a formally self-dual code but may not be linear. Three constructions are given for formally self-dual codes and existence theorems are given for codes of each type defined in the paper.

متن کامل

$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes

Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...

متن کامل

Cyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$

In this paper, we have studied cyclic codes over the ring R = Z4 +uZ4, u = 0. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over R to be a Z4-free module is presented. We have provided the general form of the generators of a cyclic code over R and determined a formula for the ranks of such codes. In this paper we have mainly focused on principally gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Theoretical Informatics and Applications

سال: 1991

ISSN: 0988-3754,1290-385X

DOI: 10.1051/ita/1991250403051